B23 - Traveling Salesman Problem

提出

code: python

n = int(input())

print(xy)

# dpij :=

解答

code: python

n = int(input())

dp = [ 1000000000.0 * n for _ in range(2 ** n) ]

dp00 = 0

for i in range(2 ** n):

for j in range(n):

if dpij < 1000000000.0:

# 都市 j から k に移動したい

for k in range(n):

if (i // (2 ** k)) % 2 == 0:

xj, xk, yj, yk = xyj0, xyk0, xyj1, xyk1

dist = ((1.0*(xj-xk)*(xj-xk) + 1.0*(yj-yk)*(yj-yk)) ** 0.5)